Stepwise Refinement of Communicating Systems
نویسنده
چکیده
The action system formalism 4] is a state-based approach to distributed computing. In this paper, it is shown how the action system formalism may be used to describe systems that communicate with their environment through synchronised value-passing. Deenitions and rules are presented for reening and decomposing such action systems into distributed implementations in which internal communication is also based on synchronised value-passing. An important feature of the composition rule is that parallel components of a distributed system may be reened independently of the rest of the system. Speciication and reenement is similar to the reenement calculus approach 2, 22, 24]. The theoretical basis for communication and distribution is Hoare's CSP 11]. Use of the reenement and decomposition rules is illustrated by the design of an unordered buuer, and then of a distributed message-passing system.
منابع مشابه
Formally Ensuring Time Constraints in a Development Process
This paper presents a method for the development of systems composed of communicating components that satisfy time constraints, by stepwise refinement. The main result is the formal proof of correctness of a refinement with time constraints. The method is illustrated by some examples. It is issued from studies on real-time embedded systems, but should apply to the specification of other executi...
متن کاملRefining Distributed Systems using the B Method
This paper makes a proposal for introducing into the B Method [3] a new refinement operator dedicated to take into account distribution fro m the very specification level through all stepwise refinement process of B abstract machines towards actual implementations. Our operator expresses how a whole system composed of many concurrent and communicating processes can be designed by refinement. Su...
متن کاملRefinement of Synchronizable Places with Multi-workflow Nets - Weak Termination Preserved!
Stepwise refinement is a well-known strategy in system modeling. The refinement rules should preserve essential behavioral properties, such as deadlock freedom, boundedness and weak termination. A well-known example is the refinement rule that replaces a safe place of a Petri net with a sound workflow net. In this case a token on the refined place undergoes a procedure that is modeled in detail...
متن کاملA Process Algebraic Approach to Decomposition of Communicating SysML Blocks
The block concept is a fundamental modelling construct in the Systems Modeling Language (SysML), a visual modelling language for systems engineering applications. In a top-down systems engineering approach, an abstract block is decomposed into concrete communicating sub-blocks. However, the classifier behaviour of the abstract block must be exhibited by the composition of the concrete sub-block...
متن کاملStepwise refinement revisited
In this paper, rigorous application of stepwise refinement is explored. The steps of definition, decomposition, and completion are described, where completion is a newly introduced step. This combination of steps extends the use of stepwise refinement to larger systems. The notions of range, active objects, and backlog interface are introduced. Verification of incomplete programs via interactiv...
متن کاملA Refinement of Communicating Processes
The programming of MIMD multiprocessors requires to design processes to be mapped on the nodes of the architecture and communicating by message passing. The aim of this paper is to give a contribution for a rationalized design of such programs from formal speciications. We introduce a reenement calculus of parallel speciications in which processes reene the safety properties and communications ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 27 شماره
صفحات -
تاریخ انتشار 1996